Simultaneous Due Date Assignment and Lot Sizing with Uncertain Flow Times
نویسندگان
چکیده مقاله:
Due date assignment for customer orders has been studied in various productionenvironments using different modeling approaches. In this paper the researchers consider aproduction system in which the orders of several customers are produced in a single batch because ofthe economy of scale. If a batch is completed before receiving customer orders, inventory carryingcost is incurred but if it is completed after receiving customer orders, shortage cost is incurred andfinally if the order is delivered after its due date, tardiness cost is charged. The problem is to decideon batch size, due date of batch (imposed on supply process) and lead time (to be quoted to the nextcoming customers) so that relevant costs are minimized. The objective function is to minimize totalcost of supply, inventory carrying, shortage and tardiness. Production flow times are probabilisticwhich follow a probability distribution. The proposed model is solved using real-coded geneticalgorithms and numerical results are presented. This work was motivated by a heavy equipmentproduction system which has some products with relatively low demand rates, high prices and longsupply lead times.
منابع مشابه
Simultaneous Lot Sizing and Scheduling in a Flexible Flow Line
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
متن کاملrobust simultaneous lot-sizing & scheduling model with uncertain demand
optimization models have been used to support decision making in production planning for a long time. however, several of those models are deterministic and do not address the variability that is present in some of the data. robust optimization is a methodology which can deal with the uncertainty or variability in optimization problems by computing a solution which is feasible for all possible ...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملRelax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملStochastic Lot-sizing Problem with Random Lead Times
We give multi-stage stochastic programming formulations for lot-sizing problems where costs, demands and order lead times follow a general discrete-time stochastic process with finite support. We characterize the properties of an optimal solution and give a dynamic programming algorithm, polynomial in input size, when orders do not cross in time.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 20 شماره 3
صفحات 263- 280
تاریخ انتشار 2007-10-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023